Drawing outerplanar graphs using three edge lengths
نویسندگان
چکیده
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmović, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.
منابع مشابه
On the Edge-Length Ratio of Outerplanar Graphs
We show that any outerplanar graph admits a planar straightline drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. This result is tight in the sense that for any > 0 there are outerplanar graphs that cannot be drawn with an edge-length ratio smaller than 2 − . We also show that every bipartite outerplanar graph has a planar straight-line drawing wit...
متن کاملOuterplanar Graph Drawings with Few Slopes
We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that ∆ − 1 edge slopes suffice for every outerplanar graph with maximum degree ∆ > 4. This improves on the previous bound of O(∆), which was shown for planar partial 3-trees,...
متن کاملStraight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Any outerplanar graph of n vertices with maximum degree d has a straight-line grid drawing with area O(dn log n). In this paper, we introduce a subclass of outerplanar graphs, which we call ...
متن کاملOuterplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one straight-line segment. We derive exact results for the minimal number of crossings in any outerplanar drawings of the following classes of graphs: 3-row meshes, Halin graphs and complete p−partite graphs with equal size...
متن کاملEdge-Weighted Contact Representations of Planar Graphs
We study contact representations of edge-weighted planar graphs, where vertices are rectangles or rectilinear polygons and edges are polygon contacts whose lengths represent the edge weights. We show that for any given edge-weighted planar graph whose outer face is a quadrangle, that is internally triangulated and that has no separating triangles we can construct in linear time an edge-proporti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 48 شماره
صفحات -
تاریخ انتشار 2015